Asynchronous Chess

نویسندگان

  • Nathaniel Gemelli
  • Robert Wright
  • Roger Mailler
چکیده

We present adversarial agent work being done in a real-time asynchronous environment, Asynchronous Chess (AChess). AChess is a real-time competitive experiment platform for developing new agent technologies using single-agent reasoning and/or multi-agent cooperative strategies. We aim to provide a simplified asynchronous environment that is stochastic in its nature, but easily described from its foundations as a synchronized game. The goal is to design agent technologies that perform better in these domains than existing singleand multi-agent methods. This research applies to non-deterministic agent-based search and reasoning technologies for use in a simplified, yet still very complex, real-time environment for competitive and adaptive

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

APHID: Asynchronous Parallel Game-Tree Search

Most parallel game-tree search approaches use synchronous methods, where the work is concentrated within a specific part of the tree, or at a given search depth. This article shows that asynchronous game-tree search algorithms can be as efficient as or better than synchronous methods in determining the minimax value. APHID, a new asynchronous parallel game-tree search algorithm, is presented. A...

متن کامل

Auditory memory function in expert chess players

Background: Chess is a game that involves many aspects of high level cognition such as memory, attention, focus and problem solving. Long term practice of chess can improve cognition performances and behavioral skills. Auditory memory, as a kind of memory, can be influenced by strengthening processes following long term chess playing like other behavioral skills because of common processing pat...

متن کامل

The Method of the Chess Search Algorithms Parallelization Using Two-processor Distributed System

This paper is concerned with the realization of the parallel computer chess application. The asynchronous parallel search algorithm uses two processors connected via distributed local network. The original solution is implemented and tested in author’s chess application Axon. The standard approaches of parallelism use dual and quad server PC machine, which is expensive and rare compared with cl...

متن کامل

بررسی ارتباط میزان افسردگی و مهارت در شطرنج اعضای دارای درجه بین المللی بازی در فدراسیون شطرنج جمهوری اسلامی ایران در سال 1389

  Background : Our purpose in this research was to evaluate the correlation between skill in chess (international chess rating scale) and severity of depression and anxiety and ten cognitive errors in members of Iranian Chess Federation that have international chess rating scale as well as to study the prevalence of depression and anxiety in the sample.   Methods: 96 persons that had an interna...

متن کامل

Parameter-Free Tree Style Pipeline in Asynchronous Parallel Game-Tree Search

Asynchronous parallel game-tree search methods are effective in improving playing strength by using many computers connected through relatively slow networks. In game position parallelization, the master program manages a game-tree and distributes positions in the tree to workers. Then, each worker asynchronously searches the best move and evaluation for its assigned position. We present a new ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005